Mining Frequent Patterns with Functional Programming
نویسندگان
چکیده
Frequent patterns are patterns such as sets of features or items that appear in data frequently. Finding such frequent patterns has become an important data mining task because it reveals associations, correlations, and many other interesting relationships hidden in a dataset. Most of the proposed frequent pattern mining algorithms have been implemented with imperative programming languages such as C, C++, Java. The imperative paradigm is significantly inefficient when itemset is large and the frequent pattern is long. We suggest a high-level declarative style of programming using a functional language. Our supposition is that the problem of frequent pattern discovery can be efficiently and concisely implemented via a functional paradigm since pattern matching is a fundamental feature supported by most functional languages. Our frequent pattern mining implementation using the Haskell language confirms our hypothesis about conciseness of the program. The performance studies on speed and memory usage support our intuition on efficiency of functional language. Keywords—Association, frequent pattern mining, functional programming, pattern matching.
منابع مشابه
On Pattern-Based Programming towards the Discovery of Frequent Patterns
The problem of frequent pattern discovery is defined as the process of searching for patterns such as sets of features or items that appear in data frequently. Finding such frequent patterns has become an important data mining task because it reveals associations, correlations, and many other interesting relationships hidden in a database. Most of the proposed frequent pattern mining algorithms...
متن کاملMining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows
Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...
متن کاملTFP-growth: An Efficient Algorithm for Mining Frequent Patterns without any Thresholds
Conventional frequent pattern mining algorithms require some user-specified minimum support, and then mine frequent patterns with support values that are higher than the minimum support. As it is difficult to predict how many frequent patterns will be mined with a specified minimum support, the Top-k mining concept has been proposed. The Top-k Mining concept is based on an algorithm for mining ...
متن کاملThe Discovery of Frequent Patterns with Logic and Constraint Programming
The basic goal of data mining is to discover patterns occurring in the databases, such as associations, classification models, sequential patterns, and so on. In this paper we focus on the problem of frequent pattern discovery, which is the process of searching for patterns such as sets of features or items that appear in data frequently. Such frequent patterns can reveal associations, correlat...
متن کاملThe Frequent Pattern List: Another Framework for Mining Frequent Patterns
The mining of frequent patterns (or frequent itemsets) plays an essential role in many tasks of data mining. One major methodology for mining frequent patterns is the Apriori-based approach, which is computationally costly because many candidate itemsets have to be generated and verified. More recently, another approach using the Frequent-Pattern Tree (FP-tree) have been suggested to avoid the ...
متن کامل